Improved Merkle Cryptosystem (IMC)

نویسندگان

  • Attila Altay Yavuz
  • Emin Anarim
  • Fatih Alagöz
چکیده

Merkle Cryptosystem (MC) is the first cryptosystem which introduces general concept of the public key cryptography. In this paper, we propose Improved Merkle Cryptosystem (IMC), which has significant security advantages over both MC and a variant of MC (VMC). In IMC, cryptographic hash functions and a new puzzle structure are used together in order to increase the security of MC and VMC. The key agreement value, which is send as clear text in VMC, is hidden using cryptographic hash function in IMC. Also, in order to increase security of the key agreement value, auxiliary keys are used. Notice that, in IMC, computational advantages of VMC remain unchanged while its security is increased. Utilizing computational advantages of VMC, IMC has also security and storage advantages over original MC. It is shown that, with these improvements, IMC can provide as high security as some wellknown public key cryptosystems while MC and VMC can not provide same security due to performance problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analytical Observations on Knapsack Cipher 0/255

We observed few important facts that concerns with the new proposal of knapsack cipher 0/255, recently published by Pham [1]. The author claimed that the time complexity for solving new improved trapdoor knapsack is O(256). In this paper, we show that the knapsack cipher 0/255 can be solved in the same time that is required for solving the basic knapsack-cipher proposed by Merkle and Hellman [2...

متن کامل

Cryptanalysis of a Public-key Cryptosystem Using Lattice Basis Reduction Algorithm

In this paper, we proposed a new attack against Hwang et al.’s cryptosystem. This cryptosystem uses a super-increasing sequence as private key and the authors investigate a new algorithm called permutation combination algorithm to enhance density of knapsack to avoid the low-density attack. Sattar J. Aboud [Aboud j. Sattar, “An improved knapsack public key cryptography system”, International Jo...

متن کامل

Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme

The basic Merkle-Hellman additive trapdoor knapsack public-key cryptosystem was recently shown to be insecure, and attacks have also been developed on stronger variants of it, such as the Graham-Shamir system and the iterated knapsack cryptosystem. This paper shows that some simple variants of another Merkle-Hellman system, the multiplicative knapsack cryptosystem, are insecure. It is also show...

متن کامل

Performance Analysis of Shamir's Attack on the Basic Merkle-Hellman Knapsack Cryptosystem

In 1978 Merkle and Hellman [11] proposed public key cryptosystems based on the knapsack problem. The simplest of these cryptosystems, the basic knapsack cryptosystem, works as follows. The public information is a set of nonnegative integers { a i : 1 ≤ i ≤ n } which are called knapsack weights. Messages are encrypted by first being broken into blocks (x 1 , ... ,x n ) of n binary digits. A bloc...

متن کامل

Merkle-Hellman Knapsack Cryptosystem in Undergraduate Computer Science Curriculum

We present our experience integrating MerkleHellman knapsack cryptosystem into undergraduate computer science curriculum. The paper focuses on the additive knapsack and ways to integrate it into the following undergraduate computer science courses: introduction to computer science, cryptology, and analysis of algorithms. Ideas for undergraduate student projects are presented and discussed.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006